Applications of Multilinear Forms to Cryptography
نویسندگان
چکیده
We study the problem of finding efficiently computable non-degenerate multilinear maps from G1 to G2, where G1 and G2 are groups of the same prime order, and where computing discrete logarithms in G1 is hard. We present several applications to cryptography, explore directions for building such maps, and give some reasons to believe that finding examples with n > 2
منابع مشابه
Multilinear forms which are products of linear forms
The conditions under which, multilinear forms (the symmetric case and the non symmetric case),can be written as a product of linear forms, are considered. Also we generalize a result due to S.Kurepa for 2n-functionals in a group G.
متن کاملMultilinear Maps and Possible Applications
In this research, we will do a survey on multilinear maps and analyze some parameters in the recent implementations. The student will compare the two implementations, in particular their similarities and improvements made by the more recent work. The student will then analyze some possible applications of multilinear maps for cryptography.
متن کاملID-based Multi-party Authenticated Key Agreement Protocols from Multilinear Forms
Nalla and Reddy [6] presented new ID-based tripartite authenticated key agreement protocols from parings. Recently, Boneh and Silverberg [4] studied a one round multi-party key agreement protocols using the certificates from multilinear forms. In this paper, we propose new ID-based multi-party authenticated key agreement protocols, which use the identity information of a user as his long-term p...
متن کاملA Primer on Cryptographic Multilinear Maps and Code Obfuscation
The construction of cryptographic multilinear maps and a general-purpose code obfuscator were two long-standing open problems in cryptography. It has been clear for a number of years that constructions of these two primitives would yield many interesting applications. This thesis describes the Coron-Lepoint-Tibouchi candidate construction for multilinear maps, as well as new candidates for code...
متن کاملIdeal Multilinear Maps based on Ideal Lattices
Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2002 شماره
صفحات -
تاریخ انتشار 2002